An Explicit Construction of Optimal Order Quasi--Monte Carlo Rules for Smooth Integrands
نویسندگان
چکیده
منابع مشابه
Evaluating the Quasi-monte Carlo Method for Discontinuous Integrands
The Monte Carlo method is an important numerical simulation tool in many applied fields such as economics, finance, statistical physics, and optimization. One of the most useful aspects of this method is in numerical integration of higher dimensions. For integrals of higher dimensions, the common numerical methods such as Simpson’s method, fail because the total number of grid points needed to ...
متن کاملWalsh Spaces Containing Smooth Functions and Quasi-Monte Carlo Rules of Arbitrary High Order
We define a Walsh space which contains all functions whose partial mixed derivatives up to order δ ≥ 1 exist and have finite variation. In particular, for a suitable choice of parameters, this implies that certain reproducing kernel Sobolev spaces are contained in these Walsh spaces. For this Walsh space we then show that quasi-Monte Carlo rules based on digital (t, α, s)-sequences achieve the ...
متن کاملOn quasi-Monte Carlo rules achieving higher order convergence
Quasi-Monte Carlo rules which can achieve arbitrarily high order of convergence have been introduced recently. The construction is based on digital nets and the analysis of the integration error uses Walsh functions. Various approaches have been used to show arbitrarily high convergence. In this paper we explain the ideas behind higher order quasi-Monte Carlo rules by leaving out most of the te...
متن کاملExplicit Constructions of Quasi-Monte Carlo Rules for the Numerical Integration of High-Dimensional Periodic Functions
In this paper we give first explicit constructions of point sets in the s dimensional unit cube yielding quasi-Monte Carlo algorithms which achieve the optimal rate of convergence of the worst-case error for numerically integrating high dimensional periodic functions. In the classical measure Pα of the worst-case error introduced by Korobov in 1959 the convergence is of O(N−min(α,d)(logN)sα−2) ...
متن کاملComputational Higher Order Quasi-Monte Carlo Integration
The efficient construction of higher-order interlaced polynomial lattice rules introduced recently in [6] is considered and the computational performance of these higher-order QMC rules is investigated on a suite of parametric, highdimensional test integrand functions. After reviewing the principles of their construction by the “fast component-by-component” (CBC) algorithm due to Nuyens and Coo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Numerical Analysis
سال: 2016
ISSN: 0036-1429,1095-7170
DOI: 10.1137/16m1060807